翻訳と辞書 Words near each other ・ Probenecid and colchicine ・ Probergrothius ・ Probert ・ Proba-V ・ PROBA2 ・ Probabilism ・ Probabilist ・ Probabilistic analysis of algorithms ・ Probabilistic Approach for Protein NMR Assignment Validation ・ Probabilistic argument ・ Probabilistic argumentation ・ Probabilistic automaton ・ Probabilistic bisimulation ・ Probabilistic causation ・ Probabilistic classification ・ Probabilistic CTL ・ Probabilistic data association filter ・ Probabilistic database ・ Probabilistic design ・ Probabilistic encryption ・ Probabilistic forecasting ・ Probabilistic latent semantic analysis ・ Probabilistic logic ・ Probabilistic logic network ・ Probabilistic method ・ Probabilistic metric space ・ Probabilistic neural network ・ Probabilistic number theory ・ Probabilistic prognosis ・ Probabilistic programming language Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Probabilistic CTL ： ウィキペディア英語版 Probabilistic CTL Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) which allows for probabilistic quantification of described properties. It has been defined in the paper by Hansson and Jonsson.〔Hansson, Hans, and Bengt Jonsson. "A logic for reasoning about time and reliability." Formal aspects of computing 6.5 (1994): 512-535.〕 PCTL is a useful logic for stating soft deadline properties, e.g. "after a request for a service, there is at least a 98% probability that the service will be carried out within 2 seconds". Akin CTL suitability for model-checking PCTL extension is widely used as a property specification language for probabilistic model checkers. == PCTL syntax == One of the possible syntax of PCTL is defined as follows: $$ \phi ::= p | \neg p | \phi \lor \phi | \phi \land \phi | \mathcal_(\phi \mathcal \phi) | \mathcal_(\square\phi) Therein, $\backslash sim\; \backslash in\; \backslash$ is comparison operator and $\backslash lambda$ is a probability threshold. Formulas of PCTL are interpreted over discrete Markov chains. An interpretation structure is a quadruple $K\; =\; \backslash langle\; S,\; s^i,\; \backslash mathcal,\; L\; \backslash rangle$, where *$S$ is a finite set of states, *$s^i\; \backslash in\; S$ is an initial state, *$\backslash mathcal$ is a transition probability function, $\backslash mathcal\; :\; S\; \backslash times\; S\; \backslash to\; ()$, such that for all $s\; \backslash in\; S$ we have $\backslash sum\_\; \backslash mathcal(s,s\text{'})=1$, and *$L$ is a labeling function, $L:S\backslash to2^A$, assigning atomic propositions to states. A path $\backslash sigma$ from a state $s\_0$ is an infinite sequence of states $s\_0\; \backslash to\; s\_1\; \backslash to\; \backslash dots\; \backslash to\; s\_n\; \backslash to\; \backslash dots$. The n-th state of the path is denoted as $\backslash sigma()$ and the prefix of $\backslash sigma$ of length $n$ is denoted as $\backslash sigma\backslash uparrow\; n$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Probabilistic CTL」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.